Efficient Durability for Lock-based Code
نویسندگان
چکیده
منابع مشابه
Durability Semantics for Lock-based Multithreaded Programs
Non-volatile storage connected as memory (NVRAM) offers promising opportunities for simplifying and accelerating manipulation of persistent data. Load and store latency is potentially comparable to that of ordinary memory. The challenge is to ensure that the persisted data remains consistent if a failure occurs during execution, especially in a multithreaded programming environment. In this pap...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملStatic Analysis of Atomicity for Programs with Lock-Free Synchronization∗
In concurrent programming, lock-free synchronization is veryefficient but difficult to design correctly. This paper presentsa static analysis to show that code blocks are atomic, i.e.,that every execution of the program is equivalent to onein which those code blocks execute without interruption byother threads. Our analysis determines commutativity ofoperations based pri...
متن کاملProduct Durability in Markets with Consumer Lock-in
This paper examines a two-period duopoly where consumers are lockedin by switching costs that they face in the second period. The paper’s main focus is on the question of how the consumer lock-in affects the firms’ choice of product durability. We show that firms may face a prisoners’ dilemma situation in that they simultaneously choose nondurable products although they would have higher profit...
متن کاملAre lock-free concurrent algorithms practically wait-free? Citation
Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. While ...
متن کامل